Computing adrenal uptakes with compact, fixed-size regions
نویسندگان
چکیده
منابع مشابه
Computing adrenal uptakes with compact, fixed-size regions.
In planar nuclear medicine imaging of the adrenal gland, there are three requirements for an uptake determination: finding the region of interest, subtracting 'background', and converting cps to muCi. A computer program that covers each requirement is outlined. The region of interest is determined by a nearest-neighbor region-growing technique. It starts from an operator-chosen center, searches...
متن کاملComputing Pure Strategy Nash Equilibria in Compact, Symmetric Games with a Fixed Number of Actions
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representations, meaning that the number of players can be exponential in the representation size. We show that in the general case, where utility functions are represented as arbitrary circuits, the problem of deciding the existence o...
متن کاملThe p-Compact-regions Problem
The p-compact-regions problem involves the search for an aggregation of n atomic spatial units into p-compact, contiguous regions. This article reports our efforts in designing a heuristic framework—MERGE (memory-based randomized greedy and edge reassignment) —to solve this problem through phases of dealing, randomized greedy, and edge reassignment. This MERGE heuristic is able to memorize (ME ...
متن کاملGroup Testing with Pools of Fixed Size
In the classical combinatorial (adaptive) group testing problem, one is given two integers d and n, where 0 ≤ d ≤ n, and a population of n items, exactly d of which are known to be defective. The question is to devise an optimal sequential algorithm that, at each step, tests a subset of the population and determines whether such subset is contaminated (i.e. contains defective items) or otherwis...
متن کاملCovering graphs with matchings of fixed size
Let m be a positive integer and let G be a graph. We consider the question: can the edge set E(G) of G be expressed as the union of a set M of matchings of G each of which has size exactly m? If this happens, we say that G is [m]-coverable and we call M an [m]-covering of G. It is interesting (and probably of some practical value) to consider minimum [m]-coverings, i.e. [m]-coverings containing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Programs in Biomedicine
سال: 1982
ISSN: 0010-468X
DOI: 10.1016/0010-468x(82)90057-5